A PERFECT star packing in a fullerene graph G is a spanning subgraph of G whose every component is isomorphic to the star graph K_1,3. A PERFECT pseudo MATCHING of a fullerene graph G is a spanning subgraph H of G such that each component of H is either K_2 or K_1,3. In this paper, we examine the number of PERFECT star packing in (3,6)-fullerene graphs and PERFECT pseudo MATCHING in chamfered fullerene graphs.